Solving problems for maximal reducible flowgraphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian Problems for Reducible Flowgraphs
In this paper, we discuss hamiltonian problems for reducible Powgraphs. The main result is finding, in linear time, the unique hamiltonian cycle, if it exists. In order to obtain this result, two other related problems are solved: finding the hamiltonian path starting at the source vertex and finding the hamiltonian cycle given the hamiltonian path.
متن کاملSolving the Flowgraphs Case with Eclectic
The TTC 2013 Flow Graphs case [3] proposes the analysis of Java programs, conforming to the JaMoPP meta-model [2], by transforming them into a language-independent meta-model which represents the structure of the program and includes information about control and data flows. This solution makes use of the Eclectic transformation tool [1] to solve the four proposed tasks. The fourth task has bee...
متن کاملAn Improved Algorithm for Solving Fuzzy Maximal Flow Problems
Kumar et al. (A new approach for solving fuzzy maximal flow problems; Lecture Notes in Computer Science, Springer-Verlag; Berlin Heidelberg, 5908, (2009) 278-286) proposed a new algorithm for solving the fuzzy maximal flow problems. In the numerical example solved by Kumar et al., by using the proposed algorithm, there exist negative part in the obtained triangular fuzzy numbers which represent...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملSolving the TTC 2013 Flowgraphs Case with FunnyQT
FunnyQT1 is a new model querying and transformation approach which is implemented as an API for the functional, JVM-based Lisp-dialect Clojure. It provides several sub-APIs for implementing different kinds of queries and transformations. For example, there is a model-to-model transformation API, and there is an in-place transformation API for writing programmed graph transformations. FunnyQT cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00449-9